package net.tp.struct.bst;

/**
 *
 * <p>Top down Red Black Tree.</p>
 *
 * <p>Top down red black tree's operations are more similar to 2-3-4 tree then bottom-up red black tree to 2-3-4 tree.</p>
 *
 * <p>Recall, red-black tree is self-balancing binary search tree with these properties</p>
 * <ul>
 *     <li>Root is black (sometimes, this rule is omitted because red root can turn black without violating other properties.</li>
 *     <li>Children of red nodes are black.</li>
 *     <li>Every simple path from root to leave contains the same number of black nodes.</li>
 * </ul>
 *
 *
 *
 *
 * @author Trung Phan
 */
public class TopDownRedBlackTree {


}
